A route pruning algorithm for an automated geographic location graph construction

Abstract Automated construction of location graphs is instrumental but challenging, particularly in logistics optimisation problems and agent-based movement simulations. Hence, we propose an algorithm for automated graphs, which vertices correspond to geographic locations interest edges direct travelling routes between them. Our approach involves two steps. In the first step, use a routing service compute distances all pairs L locations, resulting complete graph. second prune this graph by removing corresponding indirect routes, identified using triangle inequality. The computational complexity step $$\mathscr{O}(L^3)$$ O ( L 3 ) , enables computation towns cities on road network entire continent. To illustrate utility our application, constructed four regions different size infrastructures compared them manually created ground truths. simultaneously achieved precision recall values around 0.9 wide range single hyperparameter, suggesting that it valid create large manual creation infeasible.